منابع مشابه
Local Search: Is Brute-Force Avoidable?
Heuristic algorithms are the most common practical approach for solving many intractable optimization problems. In general, such algorithms start from a feasible solution and iteratively try to improve the current solution. Local search algorithms, also known as neighborhood search algorithms, form a large class of improvement algorithms. To perform local search, a problem specific neighborhood...
متن کاملLocal Search for String Problems: Brute Force Is Essentially Optimal
We address the problem of whether the brute-force procedure for the local improvement step in a local search algorithm can substantially be improved when applied to classical NP-hard string problems. We examine four of the more prominent problems in this domain: Closest String, Longest Common Subsequence, Shortest Common Supersequence, and Shortest Common Superstring. Herein, we consider arguab...
متن کاملBrute-force Collision Search for (truncated) MD5
A survey of the state of the art in distributed collision search and results of an implementation of same applied to truncated MD5.
متن کاملA Re-Examination of Brute-Force Search
In August 1992, the World Checkers Champion, Dr. Marion Tinsley, defended his title against the computer program Chinook. The best-of-40-game match was won by Tinsley with 4 wins to the program's 2. This was the first time in history that a program played for a human World Championship. Chinook, with its deep search and endgame databases, has established itself as a Grandmaster checker player. ...
متن کاملBrute Force is not Ignorance
Chaitin’s notion of program elegance, that is of the smallest program to satisfy some specification, does not explicitly take account of the balance between a formal notation’s expressive power and the richness of its semantics. To explore this wider space of elegance, we are investigating realisations of the Busy Beaver game (BBG) which involves finding programs of given size that produce maxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2012
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2011.10.003